Solving Travelling Salesman Problem by Using Optimization Algorithms
نویسندگان
چکیده
منابع مشابه
Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem
The Travelling Salesman Problem or the TSP is a representative of a large class of problems known as combinatorial optimization problems. In the ordinary form of the TSP, a map of cities is given to the salesman and he has to visit all the cities only once to complete a tour such that the length of the tour is the shortest among all possible tours for this map. The data consist of weights assig...
متن کاملAn Efficient Solving the Travelling Salesman Problem: Global Optimization of Neural Networks by Using Hybrid Method
The travelling salesman problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once (Aarts & Laarhoven, 1985; Beale & Jackson, 1990; Bout & Miller, 1988; Cichock & Unbehaun, 1993; Lin, 1965; Zurada, 199...
متن کاملNew Approach for Solving Dynamic Travelling Salesman Problem with Hybrid Genetic Algorithms and Ant Colony Optimization
Dynamic travelling salesman problem (DTSP) is one of the optimization issues which it is not solvable with classical methods. To solve this problem, various solutions in the literature can be seen that each has advantages and disadvantages. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) have been good to solve the DTSP. In this paper, we highlight a new algorithm by combining genetic ...
متن کاملSolving Asymmetric Travelling Salesman Problem using Memetic Algorithm
Memetic Algorithms have been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for Asymmetric Traveling salesman problem (ATSP). Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. Because of perfor...
متن کاملSolving Travelling Salesman Problem using Clustering Genetic Algorithm
Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improve its performance in solving TSP. Clustering Genetic Algorithm (CGA) was recently introduced and this paper analyzes the results obtained by implementing it for TSP. It is obser...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KnE Social Sciences
سال: 2018
ISSN: 2518-668X
DOI: 10.18502/kss.v3i1.1394